Splitting Without Backtracking
نویسندگان
چکیده
منابع مشابه
Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting
This work is concerned with the classical problem of finding a zero of a sum of maximal monotone operators. For the projective splitting framework recently proposed by Combettes and Eckstein, we show how to replace the fundamental subproblem calculation using a backward step with one based on two forward steps. The resulting algorithms have the same kind of coordination procedure and can be imp...
متن کاملDynamic Domain Splitting for Numeric CSPs
In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique.
متن کاملDynamic Backtracking with Constraint Propagation Application to numeric csps
Recent works on constraint relaxation [Jussien, 1997; Jussien and Boizumault, 1997b] provided the decorum system (Deduction-based Constraint Relaxation Management). That system can be seen as an integration of arc-consistency within the dynamic backtracking algorithm [Ginsberg, 1993]. Dynamic backtracking replaces the backtracking process by a much less blind behavior that consists in local mod...
متن کاملFASTA: A Generalized Implementation of Forward-Backward Splitting
where | · | denotes the `1 norm, ‖·‖ denotes the `2 norm, A is a matrix, b is a vector, and μ is a scalar parameter. This problem is of the form (1) with g(z) = μ|z|, and f(z) = 12‖z− b‖ . More generally, any problem of the form (1) can be solved by FASTA, provided the user can provide function handles to f, g, A and A . The solver FASTA contains numerous enhancements of FBS to improve converge...
متن کاملUsing nogoods information from restarts in domain-splitting search
The use of restart techniques associated with learning nogoods in solving Constraint Satisfaction Problems (CSPs) is starting to be considered of major importance for backtrack search algorithms. In a backtracking search algorithm, with domain-splitting branching, nogoods can be learned from the last branch of the search tree, immediately before the restart occurs. This type of nogoods, named d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001